English-Russian dictionary of information security . 2014.
Coding gain — In coding theory and related engineering problems, coding gain is the measure in the difference between the signal to noise ratio (SNR) levels between the uncoded system and coded system required to reach the same bit error rate (BER) levels when … Wikipedia
Distributed source coding — (DSC) is an important problem in information theory and communication. DSC problems regard the compression of multiple correlated information sources that do not communicate with each other.[1] By modeling the correlation between multiple sources … Wikipedia
Network coding — is a technique where, instead of simply relaying the packets of information they receive, the nodes of a network will take several packets and combine them together for transmission. This can be used to attain the maximum possible information… … Wikipedia
Shannon's source coding theorem — In information theory, Shannon s source coding theorem (or noiseless coding theorem) establishes the limits to possible data compression, and the operational meaning of the Shannon entropy.The source coding theorem shows that (in the limit, as… … Wikipedia
Singleton bound — In coding theory, the Singleton bound, named after Richard Collom Singleton, is a relatively crude bound on the size of a block code C with block length n, size r and minimum distance d. Contents 1 Statement of the Bound 2 Proof … Wikipedia
Noisy-channel coding theorem — In information theory, the noisy channel coding theorem (sometimes Shannon s theorem), establishes that for any given degree of noise contamination of a communication channel, it is possible to communicate discrete data (digital information)… … Wikipedia
List of algebraic coding theory topics — This is a list of algebraic coding theory topics. ARQ[disambiguation needed ] Adler 32 BCH code BCJR algorithm Berger code Berlekamp Massey algo … Wikipedia
Hamming bound — In mathematics and computer science, in the field of coding theory, the Hamming bound is a limit on the parameters of an arbitrary block code: it is also known as the sphere packing bound or the volume bound from an interpretation in terms of… … Wikipedia
Non-coding RNA — A non coding RNA (ncRNA) is a functional RNA molecule that is not translated into a protein. Less frequently used synonyms are non protein coding RNA (npcRNA), non messenger RNA (nmRNA) and functional RNA (fRNA). The term small RNA (sRNA) is… … Wikipedia
Elias gamma coding — Elias gamma code is a universal code encoding positive integers. It is used most commonly when coding integers whose upper bound cannot be determined beforehand. To code a number: #Write it in binary. #Subtract 1 from the number of bits written… … Wikipedia
Plotkin bound — In the mathematics of coding theory, the Plotkin bound is a bound on the size of binary codes of length n and minimum distance d. Statement of the Bound Let C be a binary code of length n, i.e. a subset of mathbb{F} 2^n. Let d be the minimum… … Wikipedia
